منابع مشابه
A remark on the slicing problem
The purpose of this article is to describe a reduction of the slicing problem to the study of the parameter I1(K,Z ◦ q (K)) = ∫ K ‖〈·, x〉‖Lq(K)dx. We show that an upper bound of the form I1(K,Z ◦ q (K)) 6 C1q snL2K , with 1/2 6 s 6 1, leads to the estimate Ln 6 C2 4 √ n logn q 1−s 2 , where Ln := max{LK : K is an isotropic convex body inR}.
متن کاملNetwork Farthest-Point Diagrams
Consider the continuum of points along the edges of a network, i.e., an undirected graph with positive edge weights. We measure distance between these points in terms of the shortest path distance along the network, known as the network distance. Within this metric space, we study farthest points. We introduce network farthest-point diagrams, which capture how the farthest points—and the distan...
متن کاملA remark on the second neighborhood problem
Seymour’s second neighborhood conjecture states that every simple digraph (without digons) has a vertex whose first out-neighborhood is at most as large as its second out-neighborhood. Such a vertex is said to have the second neighborhood property (SNP). We define ”good” digraphs and prove a statement that implies that every feed vertex of a tournament has the SNP. In the case of digraphs missi...
متن کاملA Remark on the Kramers Problem
1. Evolution of a physical system can be ordered in multi-timescales. Details of evolution on short-time-scale do not need for description in a closed form of a system evolution on long-time-scale and appears on this scale only in an average form. The prototype of such kind physical systems is dissipative Brownian motion of a particle in an external potential field. In this problem, with the ex...
متن کاملOn Farthest-Point Information in Networks
Consider the continuum of points along the edges of a network, an embedded undirected graph with positive edge weights. Distance between these points can be measured as shortest path distance along the edges of the network. We introduce two new concepts to capture farthest-point information in this metric space. The first, eccentricity diagrams, are used to encode the distance towards farthest ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Approximation Theory
سال: 1979
ISSN: 0021-9045
DOI: 10.1016/0021-9045(79)90120-5